Comment on ‘ Garden of Eden states in traffic model revisited ’

نویسندگان

  • Andreas Schadschneider
  • Michael Schreckenberg
چکیده

Recently, Huang and Lin suggested a combination of two successfull mean-field theories, the 2-cluster approximation and paradisical mean-field, for the Nagel-Schreckenberg cellular automaton model of traffic flow. We argue that this new approximation is inconsistent since it violates the Kolmogorov conditions. In a recent work [1] Huang and Lin have studied a combination of two mean-field theories, the 2-cluster approximation [2, 3, 4] and paradisical mean-field (PMF) [5, 4], for the Nagel-Schreckenberg cellular automaton model of traffic flow [6] (for a review, see [7]). The suggested combined theory yields results for the flow-density relation which are worse compared to Monte Carlo simulations than those of each individual approximation alone. The authors concluded that the success of paradisical mean-field theory is accidental and cannot be improved systematically, in contrast to the cluster approximation. In this comment we will show that the combined theory as suggested by Huang and Lin is inconsistent since it violates the elementary Kolmogorov conditions. This also invalidates the conclusions about the success of paradisical mean-field theory. Here we assume translational invariance so that the probabilities P τ,τ ′ do not depend on the position. An important consequence are the so-called Kolmogorov consistency conditions [8] which for the 2-cluster approximation read τ2 P τ1,τ2 = P τ1 = τ2 P τ2,τ1 (2) where P τ is the probability to find a cell in state τ. Especially for τ = x, denoting an empty cell in the notation of [1], we have P x = 1 − ρ where ρ is the total density of cars. Since also P 1 + P 2 = ρ, instead of eq. (2) in [1] one has more precisely

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LETTER TO THE EDITOR Garden of Eden states in traffic models

We investigate the allowed configurations in the stationary state of the cellular automaton model for single-lane traffic. It is found that certain states in the configuration space cannot be reached if one uses parallel dynamics. These so-called Garden of Eden (GoE) states do not exist for random-sequential dynamics and are responsible for the strong short-ranged correlations found in parallel...

متن کامل

J an 1 99 8 Garden of Eden states in traffic models

We investigate the allowed configurations in the stationary state of the cellular automaton model for single-lane traffic. It is found that certain states in the configuration space can not be reached if one uses parallel dynamics. These so-called Garden of Eden (GoE) states do not exist for random-sequential dynamics and are responsible for the strong short-ranged correlations found in paralle...

متن کامل

Kolmogorov Complexity and the Garden of Eden Theorem

Suppose τ is a cellular automaton over an amenable group and a finite alphabet. Celebrated Garden of Eden theorem states, that pre-injectivity of τ is equivalent to non-existence of Garden of Eden configuration. In this paper we will prove, that imposing some mild restrictions , we could add another equivalent assertion: non-existence of Garden of Eden configuration is equivalent to preservatio...

متن کامل

The Garden of Eden Theorem for Cellular Automata on Group Sets

We prove the Garden of Eden theorem for cellular automata with finite set of states and finite neighbourhood on right amenable left homogeneous spaces with finite stabilisers. It states that the global transition function of such an automaton is surjective if and only if it is preinjective. Pre-Injectivity means that two global configurations that differ at most on a finite subset and have the ...

متن کامل

Column-to-row Operations on Partitions: the Envelopes

Conjugation and the Bulgarian solitaire move are considered as extreme cases of several column-to-row operations on integer partitions. Each operation generates a state diagram on the partitions of n, which leads to the questions: How many Garden of Eden states are there? How many cycle states? How many connected components? All of these questions are answered for partitions of n when at least ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002